Towards Probabilistic Unification-based Parsing
نویسندگان
چکیده
Interpretation and Partition Refinement for Model CheckingD. R. DamsFaculty of Mathematics and Computing Science, TUE, 1996-13 Topological Dualities in SemanticsM. M. BonsangueFaculty of Mathematics and Computer Science, VUA, 1996-14 Algorithms for Graphs of Small TreewidthB. L. E. de FluiterFaculty of Mathematics and Computer Science, UU, 1997-01 Process-algebraic Transformations in ContextW. T. M. KarsFaculty of Computer Science, UT, 1997-02 A Generic Theory of Data TypesP. F. HoogendijkFaculty of Mathematics and Computing Science, TUE, 1997-03 The Evolution of Type Theory in Logic and MathematicsT. D. L. LaanFaculty of Mathematics and Computing Science, TUE, 1997-04 Preservation of Termination for Explicit SubstitutionC. J. BlooFaculty of Mathematics and Computing Science, TUE, 1997-05 Discrete-Time Process AlgebraJ. J. VereijkenFaculty of Mathematics and Computing Science, TUE, 1997-06 A Functional Approach to Syntax and TypingF. A. M. van den BeukenFaculty of Mathematics and Informatics, KUN, 1997-07 Ins and Outs in Refusal TestingA.W. HeerinkFaculty of Computer Science, UT, 1998-01 A Discrete-Event Simulator for Systems EngineeringG. Naumoski and W. AlbertsFaculty of Mechanical Engineering, TUE, 1998-02 Scheduling with Communication for Multiprocessor ComputationJ. VerrietFaculty of Mathematics and Computer Science, UU, 1998-03 An Asynchronous Low-Power 80C51 MicrocontrollerJ. S. H. van GageldonkFaculty of Mathematics and Computing Science, TUE, 1998-04 In Terms of Nets: System Design with Petri Nets and Process AlgebraA. A. BastenFaculty of Mathematics and Computing Science, TUE, 1998-05 Inductive Datatypes with Laws and Subtyping – A Relational ModelE. VoermansFaculty of Mathematics and Computing Science, TUE, 1999-01
منابع مشابه
Generalized Probabilistic LR Parsing of Natural Language (Corpora) with Unification-Based Grammars
We describe work toward the construction of a very wide-coverage probabilistic parsing system for natural language (NL), based on LR parsing techniques. The system is intended to rank the large number of syntactic analyses produced by NL grammars according to the frequency of occurrence of the individual rules deployed in each analysis. We discuss a fully automatic procedure for constructing an...
متن کاملA Corpus-based Probabilistic Unification Grammar
This paper describes an attempt at creating a robust parsing system for the SCHISMA task domain. We describe how a probabilistic unification grammar is generated from a corpus of utterances collected in Wizard of Oz experiments. We tagged this corpus with syntactic categories and superficial structure using Standard Generalised Markup Language (SGML). From the annotated data thus obtained a pro...
متن کاملA Novel Disambiguation Method for Unification-Based Grammars Using Probabilistic Context-Free Approximations
We present a novel disambiguation method for unification-based grammars (UBGs). In contrast to other methods, our approach obviates the need for probability models on the UBG side in that it shifts the responsibility to simpler context-free models, indirectly obtained from the UBG. Our approach has three advantages: (i) training can be effectively done in practice, (ii) parsing and disambiguati...
متن کاملIntegrating Probabilistic and Knowledge-based Approaches to Corpus Parsing
We have developed a prototype system for syntactic parsing of corpus text based on a wide-coverage unification-based grammar of English and domain-independent statistical techniques for selecting the most plausible parses from the typically large number licensed by the grammar. Although the results from initial experiments are promising, the system is ‘brittle’, relying particularly on the corr...
متن کاملDeveloping and Evaluating a Probabilistic LR Parser of Part-of-Speech and Punctuation Labels
We describe an approach to robust domain-independent syntactic parsing of unrestricted naturally-occurring (English) input. The technique involves parsing sequences of part-ofspeech and punctuation labels using a unification-based grammar coupled with a probabilistic LR parser. We describe the coverage of several corpora using this grammar and report the results of a parsing experiment using pr...
متن کاملPruning the Search Space of a Hand-Crafted Parsing System with a Probabilistic Parser
The demand for deep linguistic analysis for huge volumes of data means that it is increasingly important that the time taken to parse such data is minimized. In the XLE parsing model which is a hand-crafted, unification-based parsing system, most of the time is spent on unification, searching for valid f-structures (dependency attributevalue matrices) within the space of the many valid c-struct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1969